Gradient Flows in Filtering and Fisher-Rao Geometry
نویسندگان
چکیده
Uncertainty propagation and filtering can be interpreted as gradient flows with respect to suitable metrics in the infinite dimensional manifold of probability density functions. Such a viewpoint has been put forth in recent literature, and a systematic way to formulate and solve the same for linear Gaussian systems has appeared in our previous work where the gradient flows were realized via proximal operators with respect to Wasserstein metric arising in optimal mass transport. In this paper, we derive the evolution equations as proximal operators with respect to Fisher-Rao metric arising in information geometry. We develop the linear Gaussian case in detail and show that a template two step optimization procedure proposed earlier by the authors still applies. Our objective is to provide new geometric interpretations of known equations in filtering, and to clarify the implication of different choices of metric.
منابع مشابه
A JKO Splitting Scheme for Kantorovich-Fisher-Rao Gradient Flows
In this article we set up a splitting variant of the JKO scheme in order to handle gradient flows with respect to the Kantorovich-Fisher-Rao metric, recently introduced and defined on the space of positive Radon measure with varying masses. We perform successively a time step for the quadratic Wasserstein/Monge-Kantorovich distance, and then for the Hellinger/Fisher-Rao distance. Exploiting som...
متن کاملNatural gradient via optimal transport I
We study a natural Wasserstein gradient flow on manifolds of probability distributions with discrete sample spaces. We derive the Riemannian structure for the probability simplex from the dynamical formulation of the Wasserstein distance on a weighted graph. We pull back the geometric structure to the parameter space of any given probability model, which allows us to define a natural gradient f...
متن کاملClosed-form Posterior Cramér-Rao Bound for Active Measurement Scheduling
We here address the classical bearings-only tracking problem (BOT) for a single object, which belongs to the general class of nonlinear filtering problems. Recently, algorithms based on sequential Monte Carlo methods (particle filtering) have been proposed. As far as performance analysis is concerned, the Posterior Cramér-Rao Bound (PCRB) provides a lower bound on the mean square error. Classic...
متن کاملGradient Flows on a Riemannian Submanifold for Discrete Tomography
We present a smooth geometric approach to discrete tomography that jointly performs tomographic reconstruction and label assignment. The flow evolves on a submanifold equipped with a Hessian Riemannian metric and properly takes into account given projection constraints. The metric naturally extends the Fisher-Rao metric from labeling problems with directly observed data to the inverse problem o...
متن کاملRecursive Algorithms for Computing the Cramer-Rao Bound [Correspondence] - Signal Processing, IEEE Transactions on
Computation of the Cramer-Rao bound (CRB) on estimator variance requires the inverse or the pseudo-inverse Fisher information matrix (FIM). Direct matrix inversion can be computationally intractable when the number of unknown parameters is large. In this correspondence, we compare several iterative methods for approximating the CRB using matrix splitting and preconditioned conjugate gradient al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1710.00064 شماره
صفحات -
تاریخ انتشار 2017